Some continuous functions related to corner polyhedra, II
نویسندگان
چکیده
The group problem on the unit interval is developed, with and without continuous variables. The connection with cutting planes, or valid inequalities, is reviewed. Certain desirable properties of valid inequalities, such as minimality and extremality are developed, and the connection between valid inequalities for P(I, u 0) and P+(I, u 0) is developed. A class of functions is shown to give extreme valid inequalities for P+ (I, u0) and for certain subsets UofI. A method is used to generate such functions. These functions give faces of certain corner polyhedra. Other functions.which do not immediately give extreme valid inequalities are altered to construct a class of faces for certain corner polyhedra. This class of faces grows exponentially as the size of the group grows.
منابع مشابه
The Structure of the Infinite Models in Integer Programming
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of half-spaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our results have implications for finite dimensional corner polyhedra. One consequence is that nonnegative continuous functions suffice to describe finite dimensi...
متن کاملLight on the Infinite Group Relaxation
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integer linear optimization problems introduced by Ralph Gomory and Ellis Johnson in their groundbreaking papers titled Some continuous functions related to corner polyhedra I, II [Math. Programming 3 (1972), 23–85, 359–389]. The survey presents the infinite group problem in the modern context of cut generatin...
متن کاملInscribed and Circumscribed Polyhedra for a Convex Body and Continuous Functions on a Sphere in Euclidean Space
Two related problems concerning continuous functions on a sphere Sn−1 ⊂ Rn are studied, together with the problem of finding a family of polyhedra in Rn one of which is inscribed in (respectively, circumscribed about) a given smooth convex body in Rn. In particular, it is proved that, in every convex body K ⊂ R3, one can inscribe an eight-vertex polyhedron obtained by “equiaugmentation” of a si...
متن کاملOrigin and early evolution of corner polyhedra
Corner Polyhedra are a natural intermediate step between linear programming and integer programming. This paper first describes how the concept of Corner Polyhedra arose unexpectedly from a practical operations research problem, and then describes how it evolved to shed light on fundamental aspects of integer programming and to provide a great variety of cutting planes for integer programming. ...
متن کاملAn Algorithmic Theory of Lattice Points in Polyhedra
We discuss topics related to lattice points in rational polyhedra, including efficient enumeration of lattice points, “short” generating functions for lattice points in rational polyhedra, relations to classical and higher-dimensional Dedekind sums, complexity of the Presburger arithmetic, efficient computations with rational functions, and others. Although the main slant is algorithmic, struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 3 شماره
صفحات -
تاریخ انتشار 1972